STOCHASTIC BOUNDS FOR GENERALIZED SYSTEMS IN RELIABILITY THEORY
نویسندگان
چکیده
منابع مشابه
Generalized Reliability Bounds for Coherent Structures
In this article we introduce generalizations of several well known reliability bounds. These bounds are based on arbitrary partitions of the family of minimal path or cut sets of the system and can be used for approximating the reliability of any coherent structure with iid components. An illustration is also given of how the general results can be applied for a specific reliability structure (...
متن کاملStochastic bounds for two-layer loss systems
This paper studies multiclass loss systems with two layers of servers, where each server at the first layer is dedicated to a certain customer class, while the servers at the second layer can handle all customer classes. The routing of customers follows an overflow scheme, where arriving customers are preferentially directed to the first layer. Stochastic comparison and coupling techniques are ...
متن کاملStochastic bounds for microprocessor systems availability
The computing of stochastic bounds has become an efficient technique to obtain performance predictions for computer systems by the mean of Markovian models. However, the quality of these bounds may be affected by several properties related not only to how to use the technique but also to the Markovian model itself. On the other hand, multiprocessor systems have become an efficient and widely us...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملstochastic cell formation problem within queuing theory and considering reliability
in this study, the stochastic cell formation problem with developing model within queuing theory with stochastic demand, processing time and reliability has been presented. machine as server and part as customer are assumed where servers should service to customers. since, the cell formation problem is np-hard, therefore, deterministic methods need a long time to solve this model. in this study...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1990
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.33.103